Simplified group activity selection with group size constraints

نویسندگان

چکیده

Abstract Several real-world situations can be represented in terms of agents that have preferences over activities which they may participate. Often, the take part at most one activity (for instance, since these place simultaneously), and there are additional constraints on number participate an activity. In such a setting, we consider task assigning to reasonable way. We introduce simplified group selection problem providing general yet simple model for broad variety settings, start investigating its special case where upper lower bounds groups taken into account. apply different solution concepts as envy-freeness core stability our setting provide computational complexity study finding solutions.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Group Activity Selection Problem

We consider a setting where we have to organize one or several group activities for a group of agents. Each agent will participate in at most one activity; her preference over activities generally depends on the number of participants in the activity. The goal is to assign agents to activities in a desirable way. We give a general model, which is a natural generalization of anonymous hedonic ga...

متن کامل

Group Formation with Network Constraints

In this paper, I illustrate the importance of both dynamics and network constraints in the group formation process. I introduce a class of games called sequential group formation games, in which players make their group membership decisions sequentially over time, and show that the dynamics act as an equilibrium refinement. However, the resulting equilibrium is highly suboptimal–groups tend to ...

متن کامل

Parameterized Complexity of Group Activity Selection

We consider the Group Activity Selection Problem (GASP) in which a group of agents need to be assigned to activities, subject to agent preferences and stability conditions. In GASP, the agents announce dichotomic preferences on which (activity, number-of-participant) pairs are acceptable to them. We consider five solution concepts of assignments: (1) individual rationality (everyone who is assi...

متن کامل

Group Activity Selection from Ordinal Preferences

We consider the situation in which group activities need to be organized for a set of agents when each agent can take part in at most one activity. The agents' preferences depend both on the activity and the number of participants in that activity. In particular, the preferences are given by means of strict orders over such pairs (activity, group size), including the possibility " do nothing "....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Game Theory

سال: 2021

ISSN: ['1432-1270', '0020-7276']

DOI: https://doi.org/10.1007/s00182-021-00789-7